Independence and games
نویسندگان
چکیده
منابع مشابه
Independence and games
Hintikka and Sandu have developed IF logic as a genuine alternative to classical first-order logic: liberalizing dependence schemas between quantifiers, IF would carry out all the ideas already underlying classical logic. But they are alternatives to Hintikka’s game-theoretic approach; one could use instead Henkin quantifiers. We will present here some arguments of both technical and philosophi...
متن کاملIndependence and Hintikka games
This paper investigates the formalization of independence in logic, in particular between quantifiers. We first illustrate that this form of independence plays a role in many fields. A logic that has the possibility to express such a form of independence is Independence Friendly logic (introduced by Hintikka); its semantics is defined by means of strategies in a sequential game. It will be show...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملPolicy Games: Coordination and Independence in Monetary and Fiscal Policies
No ONE WOULD dream of designing the human anatomy by disconnecting the controls of the left and right sides of the body. Yet, for the most important economic controls in a modern economy, monetary and fiscal policies, economists today generally endorse the separation of powers as a way of optimizing noninflationary growth. What are the costs and benefits of coordination and independence in macr...
متن کاملPotential games, path independence and Poisson’s binomial distribution
This paper provides a simple characterization of potential games in terms of path independence. Using this characterization we propose an algorithm to determine if a finite game is potential or not. We define the storage requirement for our algorithm and provide its upper bound. The number of equations required in this algorithm is lower or equal to the number obtained in the algorithms propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophia Scientae
سال: 2005
ISSN: 1281-2463,1775-4283
DOI: 10.4000/philosophiascientiae.547